Applicability of Motohashi ’ S Method to Modal Logics
نویسنده
چکیده
Motohashi [8] showed that the intuitionistic predicate logics can be faithfully embedded in the classical predicate logic by a proof-theoretic method. In the present paper, we show that Motohashi’s method can be applied to a wide range of modal logics. We prove correspondence theorems based on the standard translation between classical predicate logic and the quantified versions of S4 and S5 and some subsystems of them, in a uniform way.
منابع مشابه
A hierarchy of modal logics with relative accessibility relations
In this paper we introduce and investigate various classes of multi-modal logics based on frames with relative accessibility relations. We discuss their applicability to representation and analysis of incomplete information. We provide axiom systems for these logics and we prove their completeness.
متن کاملNaming and Identity in Epistemic Logics Part I: The Propositional Case
Modal epistemic logics for many agents often assume a xed one-to-one correspondence between agents and the names for agents that occur in the language. This assumption restricts the applicability of any logic because it prohibits, for instance, anonymous agents, agents with many names, named groups of agents, and relative (indexical) reference. Here we examine the principles involved in such ca...
متن کاملJustification logics and hybrid logics
Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, w...
متن کاملA General Tableau Method for Deciding Description Logics, Modal Logics and Related First-Order Fragments
This paper presents a general method for proving termination of tableaux-based procedures for modal-type logics and related firstorder fragments. The method is based on connections between filtration arguments and a general blocking technique. The method provides a general framework for developing tableau-based decision procedures for a large class of logics. In particular, the method can be ap...
متن کاملSemantic cut-elimination for two explicit modal logics
Explicit modal logics contain modal-like terms that label formulas in a way that mimics deduction in the system. These logics have certain proof-theoretic advantages over the usual modal logics, perhaps the most important of which is conventional cut-elimination. The present paper studies tableau proof systems for two explicit modal logics, LP and S4LP. Using a certain method to prove the corre...
متن کامل